منابع مشابه
Locally planar graphs are 5-choosable
It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is 5-choosable.
متن کاملPlanar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
In this paper, we prove that planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable.
متن کاملOn 3-choosable planar graphs of girth at least 4
Let G be a plane graph of girth at least 4. Two cycles of G are intersecting if they have at least one vertex in common. In this paper, we show that if a plane graph G has neither intersecting 4-cycles nor a 5-cycle intersecting with any 4-cycle, then G is 3-choosable, which extends one of Thomassen’s results [C. Thomassen, 3-list-coloring planar graphs of girth 5, J. Combin. Theory Ser. B 64 (...
متن کاملGraphs of degree 4 are 5-edge-choosable
It is shown that every simple graph with maximal degree 4 is 5-edgechoosable. c © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 250–264, 1999
متن کاملPlanar graphs with maximum degree ∆ ≥ 9 are ( ∆ + 1 ) - edge - choosable – short proof
We give a short proof of the following theorem due to Borodin [2]. Every planar graph with maximum degree ∆ ≥ 9 is (∆ + 1)-edge-choosable. Key-words: edge-colouring, list colouring, List Colouring Conjecture, planar graphs This work was partially supported by the INRIA associated team EWIN between Mascotte and ParGO. in ria -0 04 32 38 9, v er si on 1 16 N ov 2 00 9 Les graphes planaires de deg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2010
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2009.11.013